798B - Mike and strings - CodeForces Solution

// لله درك
#pragma GCC optimize ("O3")
#pragma GCC optimization("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimization("unroll-loops")
#include <bits/extc++.h>
#define Caraxes  ios_base :: sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define int long long int
#define F first
#define S second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define inf 1e18
using namespace std;

template< typename  T = int >
std :: vector < T > get(int size = 0, std :: istream& in_stream = std :: cin);
int calc(string a, string b){
    if(a == b)
        return 0;
    if(sz(a) != sz(b))
        return -1;
    int cnt = 0;
    string tmp1 = a, tmp2 = b;
    sort(all(a));
    sort(all(b));
    for(int i = 0;i < sz(a); ++i){
        if(a[i] != b[i])
            return -1;
    }
    a = tmp1;
    b = tmp2;
    while(b != a){
        b.push_back(b.front());
        b.erase(b.begin());
        cnt++;
        if(cnt && b == tmp2)
            return -1;
    }
    return cnt;
}
void Dracarys() {
    int n;
    cin >> n;
    vector < string > v(n);
    for(int i = 0;i < n; ++i){
        cin >> v[i];
    }
    int ans = INT_MAX;
    for(int i = 0;i < n; ++i){
        int cnt = 0;
        for(int j = 0;j < n; ++j){
            int z = calc(v[i],v[j]);
            if(z == -1){
                return cout << -1,void();
            }
            cnt+= z;
        }
        ans = min(ans,cnt);
    }
    cout << ans << '\n';
}

signed main()
{
    Caraxes
     #ifndef ONLINE_JUDGE
      ::freopen("in.txt","r",stdin);
      ::freopen("out.txt","w",stdout);
    #endif
    int test = 1;
    //cin >> test;
    while(test--) {
        Dracarys();
    }
}

template< typename  T>
std :: vector < T > get(int size , std :: istream& in_stream){
    if(!size){
        in_stream >> size;
    }
    std :: vector < T > array(size);
    for(auto& i : array)
        in_stream >> i;
    return array;
}